当前位置：
首页 资源下载
搜索资源 - PARALLEL MACHINE SCHEDULING
搜索资源列表
-
0下载：
调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Scheduling problem backtracking algorithm is the classic problem. Problem Descr iption: Suppose there are n-task by the k-parallel machine can be complete
-
-
1下载：
假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task schedu
-
-
0下载：
解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved.
-
-
0下载：
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
-
-
0下载：
最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Optimal scheduling problem, assuming there are n a task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design a complet
-
-
0下载：
The basic structure of the book has not been changed in this new edition.
The book still consists of three parts and a string of Appendixes. However,
several chapters have been extended in a meaningful way, covering additional
topics that have
-
-
0下载：
有关分布式系统中多处理机任务分配与调度的部分文档-Documents related to parallel machine scheduling
-
-
0下载：
假设有n个任务由k个可并行工作的机器来完成，完成任务i需要的时间为ti，试设计一个算法找出完成这n个任务的最佳调度，式的完成全部任务的时间最早-Suppose there are n tasks done by the k-th machine can work in parallel, needed to complete the task i time Ti, try to design an algorithm to find the complete optimal scheduling
-
-
0下载：
job shop scheduling for parallel machine
-
-
0下载：
We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for process
-
-
0下载：
Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to comp
-
-
0下载：
PARALLEL MACHINE PROBLEM SA
-
-
5下载：
（模拟退火法-韩甘特图）ypap107-parallel-machine-scheduling，模拟退火算法求解并行车间调度问题程序，可运行出结果，结果可行有效（matlab编程实现）
-
